An Efficient Bit Plane X-OR Algorithm for Irreversible Image Steganography
نویسندگان
چکیده
The science of hiding secret information in another message is known as Steganography; hence the presence of secret information is concealed. It is the method of hiding cognitive content in same or another media to avoid recognition by the intruders. This paper introduces new method wherein irreversible steganography is used to hide an image in the same medium so that the secret data is masked. The secret image is known as payload and the carrier is known as cover image. XOR operation is used amongst mid level bit planes of carrier image and high level bit planes of data image to generate new low level bit planes of the stego image. Recovery process includes the XORing of low level bit planes and mid level bit planes of the stego image. Based on the result of the recovery, subsequent data image is generated. A RGB color image is used as carrier and the data image is a grayscale image of dimensions less than or equal to the dimensions of the carrier image. The proposed method greatly increases the embedding capacity without significantly decreasing the PSNR value. Keywords— Irreversible Steganography, Payload, Carrier image, High level bit plane, Mid level bit plane, Low level bit plane. Reference to this paper should be made as follows: Chakraborty, S., Jalal, A.S. and Bhatnagar, C. (2012) ‘An efficient bit plane X-ORing algorithm for irreversible image steganography’, Int. Journal of trust management in computing and communications.
منابع مشابه
Optimizing image steganography by combining the GA and ICA
In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...
متن کاملSecret Image Sharing Using Grayscale Payload Decomposition and Irreversible Image Steganography
To provide an added security level most of the existing reversible as well as irreversible image steganography schemes emphasize on encrypting the secret image (payload) before embedding it to the cover image. The complexity of encryption for a large payload where the embedding algorithm itself is complex may adversely affect the steganographic system. Schemes that can induce same level of dist...
متن کاملBPCS steganography using EZW lossy compressed images
This paper presents a steganography method based on an embedded zerotree wavelet (EZW) compression scheme and bit-plane complexity segmentation (BPCS) steganography. The proposed steganography enables us to use lossy compressed images as dummy files in bit-plane-based steganographic algorithms. Large embedding rates of around 25% of the compressed image size were achieved with little noticeable...
متن کاملHigh Capacity Image Steganography using Adjunctive Numerical Representations with Multiple Bit-Plane Decomposition Methods
LSB steganography is a one of the most widely used methods for implementing covert data channels in image file exchanges [1][2]. The low computational complexity and implementation simplicity of the algorithm are significant factors for its popularity with the primary reason being low image distortion. Many attempts have been made to increase the embedding capacity of LSB algorithms by expandin...
متن کاملA Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain
This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJTMCC
دوره 1 شماره
صفحات -
تاریخ انتشار 2013